A memristive Hopfield network for associative memory
نویسندگان
چکیده
منابع مشابه
Hopfield Network as Associative Memory with Multiple Reference Points
Hopfield model of associative memory is studied in this work. In particular, two main problems that it possesses: the apparition of spurious patterns in the learning phase, implying the well-known effect of storing the opposite pattern, and the problem of its reduced capacity, meaning that it is not possible to store a great amount of patterns without increasing the error probability in the ret...
متن کاملThe capacity of the Hopfield associative memory
Techniques from,coding theory are applied to study rigorously the capacity of the Hopfield associative memory. Such a memory stores n -tuple of + 1’s. The components change depending on a hardlimited version of linear functions of all other components. With symmetric connections between components, a stable state is ultimately reached. By building up the connection matrix as a sum-of-outer prod...
متن کاملAdaptation of Hopfield Associative Memory Parameters
The paper treats the issue of pattern recognition training in terms of Hopfield associative memory (HAM). The conventional randomization technique is used to determine the exponential extremity of HAM recognition error. The extremity exponent is considered as a function of the training process. In training, the exponent is shown to rise from (1-2p) to (1-2p) where p is the error coefficient at ...
متن کاملProbabilistic Information Capacity of Hopfield Associative Memory
T his pap er defines a form al pr obabilist ic notion for the information capac ity of the Hopfield neur al network model of associat ive memory. A mathematical express ion is derived for the number of random binary pat terns that can be stored as stable states in a Hopfield model of memory with n neur ons with a given probab ility. The derivati on is based on a new approach using two powerfu l...
متن کاملAssociative Memristive Memory for Approximate Computing in GPUs
Associative memory, in the form of lookup tables, is a promising approach to improving energy efficiency by enabling computing-with-memory. A processing element can be tightly coupled with an associative memory where function responses are pre-stored. Associative memories can recall function responses for a subset of input values therefore avoiding the actual function execution on the processin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Protocol Exchange
سال: 2015
ISSN: 2043-0116
DOI: 10.1038/protex.2015.070